Differential Fast Fixed-Point BSS for Underdetermined Linear Instantaneous Mixtures
نویسندگان
چکیده
This paper concerns underdetermined linear instantaneous blind source separation (BSS), i.e. the case when the number P of observed mixed signals is lower than the number N of sources. We propose a partial BSS method, which separates P supposedly non-stationary sources of interest one from the others (while keeping residual components for the other N −P , supposedly stationary, ”noise” sources). This method is based on the general differential BSS concept that we introduced before. Unlike our previous basic application of that concept, this improved method consists of a differential extension of the FastICA method (which does not apply to underdetermined mixtures), thus keeping the attractive features of the latter algorithm. Our approach is therefore based on a differential sphering, followed by the optimization of the differential kurtosis that we introduce in this paper. Experimental tests show that this differential method is much more robust to noise than standard FastICA.
منابع مشابه
A second-order differential approach for underdetermined convolutive source separation
This paper concerns the underdetermined case of the convolutive source separation problem, i.e. the situation when the number of observed convolutively mixed signals is lower than the number of sources. We propose a criterion and associated algorithm which, unlike classical approaches, make it possible to perform the separation of a subset of these sources by exploiting their assumed non-statio...
متن کاملAlgorithmes temporels rapides de type point fixe pour la séparation aveugle de mélanges convolutifs Time-domain fast fixed-point algorithms for blind separation of convolutive mixtures
This paper presents new blind separation methods for Moving Average (MA) convolutive mixtures of independent MA processes. They consist of time-domain extensions of the FastICA algorithms developed by Hyvärinen and Oja for instantaneous mixtures. They perform a convolutive sphering in order to use parameter-free fast fixed-point algorithms associated with kurtotic or negentropic nongaussianity ...
متن کاملBlind Separation of Sparse Sources Using Jeffrey's Inverse Prior and the EM Algorithm
In this paper we study the properties of the Jeffrey’s inverse prior for blind separation of sparse sources. This very sparse prior was previously used for Wavelet-based image denoising. In this paper we consider separation of 3×3 and 2×3 noisy mixtures of audio signals, decomposed on a MDCT basis. The hierarchical formulation of the inverse prior allows for EM-based computation of MAP estimate...
متن کاملحذف کلاتر قوی دریا با استفاده از الگوریتم DUET BSS
Abstract- Suppressing clutter is one of the most crucial phases in radar signal processing. Also, Blind Source Separation (BSS) is one of the recent and very important problems in signal processing that shows its efficiency in many applications. Degenerate Unmixin Estimation Technique (DUET) is one of the Underdetermined BSS algorithms that separate sources from mixtures using only two mixtures...
متن کاملBlind separation of speech and sub-Gaussian signals in underdetermined case
Conventional blind source separation (BSS) algorithms are applicable when the number of sources equals to that of observations; however, they are inapplicable when the number of sources is larger than that of observations. Most underdetermined BSS algorithms have been developed based on an assumption that all sources have sparse distributions. These algorithms are applicable to separate speech ...
متن کامل